Incorporating auxiliary information for improved prediction using combination of kernel machines
نویسندگان
چکیده
منابع مشابه
Incorporating auxiliary information for improved prediction in high-dimensional datasets: an ensemble of shrinkage approaches.
With advancement in genomic technologies, it is common that two high-dimensional datasets are available, both measuring the same underlying biological phenomenon with different techniques. We consider predicting a continuous outcome Y using X, a set of p markers which is the best available measure of the underlying biological process. This same biological process may also be measured by W, comi...
متن کاملApplication of soil properties, auxiliary parameters, and their combination for prediction of soil classes using decision tree model
Soil classification systems are very useful for a simple and fast summarization of soil properties. These systems indicate the method for data summarization and facilitate connections among researchers, engineers, and other users. One of the practical systems for soil classification is Soil Taxonomy (ST). As determining soil classes for an entire area is expensive, time-consuming, and almost ...
متن کاملFast Prediction for Large-Scale Kernel Machines
Kernel machines such as kernel SVM and kernel ridge regression usually construct high quality models; however, their use in real-world applications remains limited due to the high prediction cost. In this paper, we present two novel insights for improving the prediction efficiency of kernel machines. First, we show that by adding “pseudo landmark points” to the classical Nyström kernel approxim...
متن کاملTreelet Kernel Incorporating Chiral Information
Molecules being often described using a graph representation, graph kernels provide an interesting framework which allows to combine machine learning and graph theory in order to predict molecule’s properties. However, some of these properties are induced both by relationships between the atoms of a molecule and by constraints on the relative positioning of these atoms. Graph kernels based sole...
متن کاملEfficient Kernel Machines Using the Improved Fast Gauss Transform
The computation and memory required for kernel machines with N training samples is at least O(N). Such a complexity is significant even for moderate size problems and is prohibitive for large datasets. We present an approximation technique based on the improved fast Gauss transform to reduce the computation to O(N). We also give an error bound for the approximation, and provide experimental res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Methodology
سال: 2015
ISSN: 1572-3127
DOI: 10.1016/j.stamet.2014.08.001